Single machine scheduling with a general exponential learning effect
نویسندگان
چکیده
منابع مشابه
A note on "Single-machine scheduling with general learning functions"
The recent paper ‘‘Single-machine scheduling with general learning functions’’ (Wang [1]) addresses the single-machine scheduling problems with a sum-of-processing-times-based learning effect. The author showed that that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. He also showed by examples that the optimal schedule for the cla...
متن کاملTwo Exponential Neighborhoods For Single Machine Scheduling
We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.
متن کاملA single-machine learning effect scheduling problemwith release times
Article history: Received 29 February 2008 Accepted 16 January 2009 Available online 30 January 2009
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2012
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.07.002